An interactive method for the eigenvalue problem for matrices

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

On the nonnegative inverse eigenvalue problem of traditional matrices

In this paper, at first for a given set of real or complex numbers $sigma$ with nonnegative summation, we introduce some special conditions that with them there is no nonnegative tridiagonal matrix in which $sigma$ is its spectrum. In continue we present some conditions for existence such nonnegative tridiagonal matrices.

متن کامل

An iterative method for the solution of the algebraic eigenvalue problem for Hermitian matrices

An iterative method for the solution of the algebraic eigenvalue problem for Hermitian matrices " (1974). INFORMATION TO USERS This material was produced from a microfilm copy of the original document. While the most advanced technological means to photograph and reproduce this document have been used, the quality is heavily dependent upon the quality of the original submitted. The following ex...

متن کامل

An inverse eigenvalue problem for symmetrical tridiagonal matrices

We consider the following inverse eigenvalue problem: to construct a symmetrical tridiagonal matrix from the minimal and maximal eigenvalues of all its leading principal submatrices. We give a necessary and sufficient condition for the existence of such a matrix and for the existence of a nonnegative symmetrical tridiagonal matrix. Our results are constructive, in the sense that they generate a...

متن کامل

An Arnoldi like method for the delay eigenvalue problem

The method called Arnoldi is currently a very popular method to solve largescale eigenvalue problems. The general purpose of this paper is to generalize Arnoldi to the characteristic equation of a delay-differential equation (DDE), here called a delay eigenvalue problem. The DDE can equivalently be expressed with a linear infinite dimensional operator which eigenvalues are the solutions to the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 1990

ISSN: 0898-1221

DOI: 10.1016/0898-1221(90)90192-m